TSTP Solution File: SET586^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET586^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:14:15 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 32 ( 5 unt; 14 typ; 0 def)
% Number of atoms : 228 ( 60 equ; 0 cnn)
% Maximal formula atoms : 12 ( 12 avg)
% Number of connectives : 91 ( 30 ~; 17 |; 30 &; 0 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 45 ( 44 >; 1 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 3 con; 0-6 aty)
% Number of variables : 51 ( 0 ^ 27 !; 18 ?; 51 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a ).
thf(func_def_8,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_9,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_10,type,
vAND: $o > $o > $o ).
thf(func_def_11,type,
vOR: $o > $o > $o ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f50,plain,
$false,
inference(subsumption_resolution,[],[f49,f48]) ).
thf(f48,plain,
$true = vAPP(a,$o,sK1,sK3),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ( $true != $true )
| ( $true = vAPP(a,$o,sK1,sK3) ) ),
inference(superposition,[],[f13,f14]) ).
thf(f14,plain,
$true = vAPP(a,$o,sK0,sK3),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( ( $true != vAPP(a,$o,sK2,sK3) )
| ( $true != vAPP(a,$o,sK1,sK3) ) )
& ( $true = vAPP(a,$o,sK2,sK3) )
& ( $true = vAPP(a,$o,sK0,sK3) )
& ! [X4: a] :
( ( $true = vAPP(a,$o,sK1,X4) )
| ( $true != vAPP(a,$o,sK0,X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( vAPP(a,$o,X2,X3) != $true )
| ( vAPP(a,$o,X1,X3) != $true ) )
& ( vAPP(a,$o,X2,X3) = $true )
& ( vAPP(a,$o,X0,X3) = $true ) )
& ! [X4: a] :
( ( $true = vAPP(a,$o,X1,X4) )
| ( $true != vAPP(a,$o,X0,X4) ) ) )
=> ( ? [X3: a] :
( ( ( $true != vAPP(a,$o,sK2,X3) )
| ( $true != vAPP(a,$o,sK1,X3) ) )
& ( $true = vAPP(a,$o,sK2,X3) )
& ( $true = vAPP(a,$o,sK0,X3) ) )
& ! [X4: a] :
( ( $true = vAPP(a,$o,sK1,X4) )
| ( $true != vAPP(a,$o,sK0,X4) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X3: a] :
( ( ( $true != vAPP(a,$o,sK2,X3) )
| ( $true != vAPP(a,$o,sK1,X3) ) )
& ( $true = vAPP(a,$o,sK2,X3) )
& ( $true = vAPP(a,$o,sK0,X3) ) )
=> ( ( ( $true != vAPP(a,$o,sK2,sK3) )
| ( $true != vAPP(a,$o,sK1,sK3) ) )
& ( $true = vAPP(a,$o,sK2,sK3) )
& ( $true = vAPP(a,$o,sK0,sK3) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( vAPP(a,$o,X2,X3) != $true )
| ( vAPP(a,$o,X1,X3) != $true ) )
& ( vAPP(a,$o,X2,X3) = $true )
& ( vAPP(a,$o,X0,X3) = $true ) )
& ! [X4: a] :
( ( $true = vAPP(a,$o,X1,X4) )
| ( $true != vAPP(a,$o,X0,X4) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X4: a] :
( ( ( $true != vAPP(a,$o,X2,X4) )
| ( $true != vAPP(a,$o,X1,X4) ) )
& ( $true = vAPP(a,$o,X2,X4) )
& ( $true = vAPP(a,$o,X0,X4) ) )
& ! [X3: a] :
( ( vAPP(a,$o,X1,X3) = $true )
| ( vAPP(a,$o,X0,X3) != $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X4: a] :
( ( ( $true != vAPP(a,$o,X2,X4) )
| ( $true != vAPP(a,$o,X1,X4) ) )
& ( $true = vAPP(a,$o,X2,X4) )
& ( $true = vAPP(a,$o,X0,X4) ) )
& ! [X3: a] :
( ( vAPP(a,$o,X1,X3) = $true )
| ( vAPP(a,$o,X0,X3) != $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( vAPP(a,$o,X0,X3) = $true )
=> ( vAPP(a,$o,X1,X3) = $true ) )
=> ! [X4: a] :
( ( ( $true = vAPP(a,$o,X2,X4) )
& ( $true = vAPP(a,$o,X0,X4) ) )
=> ( ( $true = vAPP(a,$o,X2,X4) )
& ( $true = vAPP(a,$o,X1,X4) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( vAPP(a,$o,X0,X3)
=> vAPP(a,$o,X1,X3) )
=> ! [X4: a] :
( ( vAPP(a,$o,X2,X4)
& vAPP(a,$o,X0,X4) )
=> ( vAPP(a,$o,X2,X4)
& vAPP(a,$o,X1,X4) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( vAPP(a,$o,X0,X3)
=> vAPP(a,$o,X1,X3) )
=> ! [X3: a] :
( ( vAPP(a,$o,X2,X3)
& vAPP(a,$o,X0,X3) )
=> ( vAPP(a,$o,X2,X3)
& vAPP(a,$o,X1,X3) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( vAPP(a,$o,X0,X3)
=> vAPP(a,$o,X1,X3) )
=> ! [X3: a] :
( ( vAPP(a,$o,X2,X3)
& vAPP(a,$o,X0,X3) )
=> ( vAPP(a,$o,X2,X3)
& vAPP(a,$o,X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_40_pme) ).
thf(f13,plain,
! [X4: a] :
( ( $true != vAPP(a,$o,sK0,X4) )
| ( $true = vAPP(a,$o,sK1,X4) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f49,plain,
$true != vAPP(a,$o,sK1,sK3),
inference(subsumption_resolution,[],[f16,f15]) ).
thf(f15,plain,
$true = vAPP(a,$o,sK2,sK3),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( ( $true != vAPP(a,$o,sK2,sK3) )
| ( $true != vAPP(a,$o,sK1,sK3) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET586^5 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 17:06:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (31198)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (31200)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (31199)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38 % (31202)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.38 % (31201)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.38 % (31204)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.38 % (31203)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.38 % (31205)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38 % (31202)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.38 % (31201)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.38 % Exception at run slice level% Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38 % (31204)Also succeeded, but the first one will report.
% 0.14/0.38 % (31203)First to succeed.
% 0.14/0.38 % (31201)Also succeeded, but the first one will report.
% 0.14/0.38 % (31203)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31198"
% 0.14/0.38 % (31203)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (31203)------------------------------
% 0.14/0.38 % (31203)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (31203)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (31203)Memory used [KB]: 757
% 0.14/0.38 % (31203)Time elapsed: 0.005 s
% 0.14/0.38 % (31203)Instructions burned: 5 (million)
% 0.14/0.38 % (31198)Success in time 0.007 s
%------------------------------------------------------------------------------